Automated Navigation System based on Weapon-Target Assignment

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Weapon Target Assignment Strategy Research on Genetic Algorithm

The weapon target assignment is an important problem in modern air defense combat with multiobjects and fighters. The weapons units arrange is a dynamic and complex process, for saving weapons resources and attacking target effectively, the weapon target assignment model satisfies expected damage probability, the performance analysis such as target threat degree, the weapon attack priority and ...

متن کامل

Exact and Heuristic Methods for the Weapon Target Assignment Problem

The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so that the total expected survival value of the targets after all the engagements is minimum. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-com...

متن کامل

Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem

The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so that the total expected survival value of the targets after all the engagements is minimum. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-com...

متن کامل

A Lagrange Relaxation Method for Solving Weapon-Target Assignment Problem

We study the weapon-target assignment WTA problem which has wide applications in the area of defense-related operations research. This problem calls for finding a proper assignment of weapons to targets such that the total expected damaged value of the targets to be maximized. The WTA problem can be formulated as a nonlinear integer programming problem which is known to be NP-complete. There do...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: TELKOMNIKA (Telecommunication Computing Electronics and Control)

سال: 2011

ISSN: 2302-9293,1693-6930

DOI: 10.12928/telkomnika.v9i3.735